Robert COWEN A COMPACTNESS THEOREM FOR INFINITE CONSTRAINT SATISFACTION
نویسندگان
چکیده
Constraint satisfaction problems are very common in computer science; in fact it has been claimed in [2] that most of the problems in Garey and Johnson [5] can be naturally expressed as constraint satisfaction. Since many of these problems have infinite analogues it seems reasonable to consider infinite constraint satisfaction. Then by proving a compactness result for the infinite constraint satisfaction, a useful general theorem is obtained which gives immediately various well known compactness results for propositional logic, graph coloring, etc.
منابع مشابه
A Compactness Theorem for In nite
A useful compactness theorem for constraint satisfaction problems is proved equivalent to BPI, the Boolean Prime Ideal Theorem. The relation of various restricted versions of the Theorem to each other and to BPI is also explored.
متن کاملA new proof of the compactness theorem for propositional logic
The compactness theorem for propositional logic states that a demumerable set of propositional formulas is satisfiable if every finite subset is satisfiable. Though there are many different proofs, the underlying combinatorial basis of most of them seems to be Kόnig's lemma on infinite trees (see Smullyan [2], Thomson [3]). We base our proof on a different combinatorial lemma due to R. Rado [1]...
متن کاملGraph Coloring Compactness Theorems Equivalent to BPI
We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .
متن کاملG-free Colorability and the Boolean Prime Ideal Theorem
We show that the compactness of G-free k-colorability is equivalent to the Boolean prime ideal theorem for any graph G with more than two vertices and any k ≥ 2.
متن کاملGeneralizing König's infinity lemma
1 Introduction D. Kόnig's famous lemma on trees has many applications; in graph theory it is used to extend certain results from finite to infinite graphs (see Nash-Williams [7]); in logic it can be used to prove that a denumerable set of propositional formulas is satisfiable if every finite subset is (see, for example, Van Fraassen [9]). This last result, known as the compactness theorem for p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005